Exploiting independent subformulas: A faster approximation scheme for #k-SAT
نویسندگان
چکیده
منابع مشابه
Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT
We present an improvement on Thurley’s recent randomized approximation scheme for #k-SAT where the task is to count the number of satisfying truth assignments of a Boolean function Φ given as an n-variable k-CNF. We introduce a novel way to identify independent substructures of Φ and can therefore reduce the size of the search space considerably. Our randomized algorithm works for any k. For #3...
متن کاملAn Approximation Algorithm for #k-SAT
We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #k-SAT for any k ≥ 3 within a running time that is not only non-trivial, but also significantly better than that of the currently fastest exact algorithms for the problem. More ...
متن کاملPPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster
The currently fastest known algorithm for k-SAT is PPSZ named after its inventors Paturi, Pudlák, Saks, and Zane [7]. Analyzing its running time is much easier for input formulas with a unique satisfying assignment. In this paper, we achieve three goals. First, we simplify Hertli’s 2011 analysis [1] for input formulas with multiple satisfying assignments. Second, we show a “translation result”:...
متن کاملFaster Geometric K-point MST Approximation
We give fast new approximation algorithms for the problem of choosing k planar points out of n to minimize the length of their minimum spanning tree (equivalently, of their traveling salesman tour or Steiner tree). For any x ≤ k, we can find an approximation achieving approximation ratio O(log k/ log x) in time O(n log n+ 2kn log k). In particular, we get an approximation with ratio O(log k/ lo...
متن کاملFaster Approximation for Maximum Independent Set on Unit Disk Graph
Maximum independent set from a given set D of unit disks intersecting a horizontal line can be solved in O(n) time and O(n) space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph which takes both time and space of O(n). The best known factor 2 approximation algorithm for this problem runs in O(n logn) time and takes O(n) sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2013
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.02.013